Efficient CCA-secure Threshold Public-Key Encryption Scheme
نویسندگان
چکیده
In threshold public-key encryption, the decryption key is divided into n shares, each one of which is given to a different decryption user in order to avoid single points of failure. In this study, we propose a simple and efficient non-interactive threshold publickey encryption scheme by using the hashed Diffie-Hellman assumption in bilinear groups. Compared with the other related constructions, the proposed scheme is more efficient.
منابع مشابه
CCA Secure Publicly Verifiable Public Key Encryption Without Pairings Nor Random Oracle and Its Applications
hosen ciphertext security (CCA security)hosen ciphertext security (CCA security)C is now a widely accepted necessary security notion for public key encryption. CCA secure public verifiable public key encryption has many applications such as threshold public key encryption and proxy re-encryption etc. Furthermore, these years “random oracle model” has seen risen criticize by many cryptographers....
متن کاملLattice Based Efficient Threshold Public Key Encryption Scheme
A (t,u)threshold public key encryption (TPKE) is a public key encryption where a private key is splitted among u decryption servers (insiders) and at least t decryption servers (insiders) are required to decrypt the ciphertext but no group of t− 1 or less malicious insiders can decrypt the message. Bendlin and Damgard [1] presented first lattice based threshold public key encryption scheme base...
متن کاملThreshold Cryptosystems Secure against Chosen-Ciphertext Attacks
Semantic security against chosen-ciphertext attacks (INDCCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is often dangerous to give to only one people the power of decryption. Therefore, threshold cryptosystems aimed at distributing the decryption ability. However, only two efficient such schemes have been proposed so far for achievin...
متن کاملA new paradigm of chosen ciphertext secure public key encryption scheme
For all current adaptive chosen ciphertext(CCA) secure public key encryption schemes in standard model there are two operations in the decryption algorithm, “validity check” and decryption. The decryption algorithm returns the corresponding plaintext if the ciphertext is valid otherwise it returns a rejection symbol ⊥. We call this paradigm “invalid ciphertext rejection”. However the “validity ...
متن کاملConstruction of Threshold Public-Key Encryptions through Tag-Based Encryptions
In this paper, we propose a notion of threshold tag-based encryption schemes that simplifies the notion of threshold identity-based encryption schemes, and we show a conversion from any stag-CCAsecure threshold tag-based encryption schemes to CCA-secure threshold public-key encryption schemes. Moreover, we give two concrete constructions of stag-CCA-secure threshold tag-based encryption schemes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013